Multi-Edge Type LDPC Codes
نویسندگان
چکیده
We introduce multi-edge type LDPC codes, a generalization of the concept of irregular LDPC codes that yields improvements in performance, range of applications, adaptability and error floor. The multiedge type LDPC codes formalism includes various constructions that have been proposed in the literature including, among others, concatenated tree (CT) codes [1], (generalized irregular) repeat accumulate (RA) codes [2], [3], and codes in [4], [5]. We present results establishing the improved performance afforded by this more general framework. We also indicate how the analysis of LDPC codes presented in [6], [7] extends to the multi-edge type setting.
منابع مشابه
[hal-00670720, v1] Weight Distributions of Multi-Edge type LDPC Codes
The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the densi...
متن کاملAverage Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles
Multi-Edge type Low-Density Parity-Check codes (METLDPC codes) introduced by Richardson and Urbanke are generalized LDPC codes which can be seen as LDPC codes obtained by concatenating several standard (ir)regular LDPC codes. We prove in this paper that MET-LDPC code ensembles possess a certain symmetry with respect to their Average Coset Weight Distributions (ACWD). Using this symmetry, we dri...
متن کاملA Joint Optimization Technique for Multi-Edge Type LDPC Codes
This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC c...
متن کاملMulti-Edge type Unequal Error Protection LDPC codes
Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC cod...
متن کاملThe New Multi-Edge Metric-Constrained PEG/QC-PEG Algorithms for Designing the Binary LDPC Codes With Better Cycle-Structures
To obtain a better cycle-structure is still a challenge for the low-density parity-check (LDPC) code design. This paper formulates two metrics firstly so that the progressive edge-growth (PEG) algorithm and the approximate cycle extrinsic message degree (ACE) constrained PEG algorithm are unified into one integrated algorithm, called the metric-constrained PEG algorithm (M-PEGA). Then, as an im...
متن کامل